Public Evidence from Secret Ballots
نویسندگان
چکیده
Elections seem simple—aren’t they just about counting? But they have a unique, challenging combination of security and privacy requirements. The stakes are high; the context is adversarial; the electorate needs to be convinced that the results are correct; and the secrecy of the ballot must be ensured. They also have practical constraints: time is of the essence, and voting systems need to be affordable and maintainable, as well as usable by voters, election officials, and pollworkers. It is thus not surprising that voting is a rich research area spanning theory, applied cryptography, practical systems analysis, usable security, and statistics. Election integrity involves two key concepts: convincing evidence that outcomes are correct and privacy, which amounts to convincing assurance that there is no evidence about how any given person voted. These are obviously in tension. We examine how current systems walk this tightrope.
منابع مشابه
An Introduction to PunchScan
Punchscan is a precinct-read optical-scan balloting system that allows voters to take their ballot with them after scanning. This does not violate the secret ballot principle because the ballots cannot be read without secret information held by the authority in charge of the election. In fact, this election authority will publish the ballots for everyone to see, allowing voters whose ballots we...
متن کاملConsequences of the Secret Ballot and Electronic Voting
for SSCW-2004 March 14, 2004 Secret ballots were introduced for public elections in Australia, followed by the U.S., in the latter half of the 19 Century. The ostensible reason for their introduction was to prevent coercion by employers and political parties, who often controlled the printing and distribution of ballots and could thus prevent their supporters from deviating from the “party line...
متن کاملThe Security Power of the Ballot Box
We show that any function f can be securely evaluated by a protocol with ballots and a ballot box. That is, n mutually suspicious players, each player i possessing a secret input xi, can use ballots and ballot boxes to jointly evaluate f(x1, . . . , xn) = (y1, . . . , yn), so that (no matter how many players may collude and deviate from their prescribed instructions, and no matter how long they...
متن کاملThe Security Power of the Ballot Box Patterns in Pitch Periods
We show that any function f can be securely evaluated by a protocol with ballots and a ballot box. That is, n mutually suspicious players, each player i possessing a secret input xi, can use ballots and ballot boxes to jointly evaluate f(x1, . . . , xn) = (y1, . . . , yn), so that (no matter how many players may collude and deviate from their prescribed instructions, and no matter how long they...
متن کاملA quantum secret ballot
Boaz Tamir Department of Philosophy of Science, Bar-Ilan University, Ramat-Gan, Israel.‡ Abstract The paper concerns the protection of the secrecy of ballots, so that the identity of the voters cannot be matched with their vote. To achieve this we use an entangled quantum state to represent the ballots. Each ballot includes the identity of the voter, explicitly marked on the ”envelope” containi...
متن کامل